// url:https://codeforces.com/contest/1687/problem/C
// time:2022-06-03 19:33:12
// name:C-SanaeandGiantRobot

// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
// mt19937 mrand(random_device{}());
// int rnd(int x) { return mrand() % x; }
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
int lg2(int64 x) { return sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int cas;
  cin >> cas;
  while (cas--) {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < n; ++i) {
      int x;
      cin >> x;
      a[i] -= x;
    }
    vector<int64> sum(n + 1);
    for (int i = 0; i < n; ++i) sum[i + 1] = sum[i] + a[i];
    trace(a, sum);
    vector<bool> mark(n + 1);
    for (int i = 0; i <= n; ++i) mark[i] = sum[i] == 0;

    set<int> can;
    for (int i = 0; i < n; ++i) {
      if (!mark[i]) can.insert(i);
    }
    vector<vector<int>> ll(n + 1), rr(n + 1);
    queue<ii> Q;
    map<ii, int> A;
    vector<bool> visit(m);
    for (int i = 0; i < m; ++i) {
      int L, R;
      cin >> L >> R;
      --L;
      rr[L].push_back(R);
      ll[R].push_back(L);
      A[{L, R}] = i;
      if (mark[L] && mark[R]) {
        Q.push({L, R});
        visit[i] = 1;
      }
    }

    // vector<int> cnt(n + 1);
    while (!Q.empty()) {
      auto [L, R] = Q.front();
      // cnt[L]++; cnt[R]--;
      trace(L, R, mark);
      Q.pop();
      while (true) {
        auto it = can.lower_bound(L);
        if (it == can.end() || *it >= R) break;
        int i = *it;
        can.erase(i);
        mark[i] = 1;
        for (auto& ni : rr[i]) {
          if (ni <= n) {
            if (mark[i] && mark[ni] && A.count({i, ni})) {
              int k = A[{i, ni}];
              if (!visit[k]) {
                Q.push({i, ni});
                visit[k] = 1;
              }
            }
          }
        }
        for (auto& pi : ll[i]) {
          if (pi >= 0) {
            if (mark[pi] && mark[i] && A.count({pi, i})) {
              int k = A[{pi, i}];
              if (!visit[k]) {
                Q.push({pi, i});
                visit[k] = 1;
              }
            }
          }
        }
      }
    }

    bool ok = 1;
    // int cover = 0;
    for (int i = 0; i <= n; ++i) {
      if (!mark[i]) ok = 0;
      // cover += cnt[i];
      // if (i < n && cover == 0) ok = 0;
    }
    cout << (ok ? "YES" : "NO") << '\n';
  }

  return 0;
}

